18.783 Elliptic Curves Spring 2013 Lecture #7 02/28/2013

نویسنده

  • Andrew V. Sutherland
چکیده

E[n] ' { Z/nZ⊕ Z/nZ if p = 0 or p n, Z/nZ or {0} if p > 0 and n is a power of p. Proof. Assume p n and let ` be a prime dividing n. Then the multiplication-by-` map [`] is separable of degree `2, and therefore E[`] = ker[`] has order `2. Every nonzero element of E[`] has order `, and it follows that E[`] ' Z/`Z ⊗ Z/`Z. Thus the `-rank of E[`], and hence of E[n], is 2. If `e is the largest power of ` dividing n, then the `-Sylow subgroup of E[n] is E[`e], which must be isomorphic to Z/`eZ⊕ Z/`eZ, since it has order `2e, `-rank 2, and no elements of order greater than `e. It follows that E[n] ' Z/nZ⊕ Z/nZ. If the characteristic p is not zero, then [p] is inseparable and its kernel E[p] therefore has order strictly less than deg [p] = p2. Since E[p] is a p-group of order less than p2, it must be isomorphic to either Z/pZ or {0}. If n = pk, then [n] = [p]k, and E[pk] is isomorphism to either Z/pkZ or {0} depending on whether E[p] is isomorphic to Z/pZ or {0}, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

18.783 Elliptic Curves Spring 2013 Lecture #24 05/09/2013

Andrew V. Sutherland In this lecture we give a brief overview of modular forms, focusing on their relationship to elliptic curves. This connection is crucial to Wiles’ proof of Fermat’s Last Theorem [7]; the crux of his proof is that every semistable elliptic curve over Q is modular.1 In order to explain what this means, we need to delve briefly into the theory of modular forms. Our goal in doi...

متن کامل

18.783 Elliptic Curves Spring 2013 Lecture #20 04/25/2013 20.1 The Hilbert class polynomial

Let O be an order of discriminant D in an imaginary quadratic field K. In Lecture 19 we saw that there is a one-to-one relationship between isomorphism classes of elliptic curves with complex multiplication by O (the set EllO(C)), and equivalence classes of proper Oideals (the group cl(O)). The first main theorem of complex multiplication states that the elements of EllO(C) are algebraic intege...

متن کامل

18.783 Elliptic Curves Spring 2013 Lecture #9 03/07/2013 9.1 Schoof’s Algorithm

In the early 1980’s, René Schoof [3] introduced the first polynomial-time algorithm to compute #E(Fq). Extensions of Schoof’s algorithm remain the point-counting method of choice when the characteristic of Fq is large (e.g., when q is a cryptographic size prime).1 Schoof’s basic strategy is very simple: compute the the trace of Frobenius tmodulo many small primes ` and use the Chinese remainder...

متن کامل

18.783 Elliptic Curves Spring 2013 Lecture #6 02/26/2013

The polynomial v(x) allows us to determine the points in E(k̄) that lie in the kernel of α. Indeed, we have kerα = {(x0, y0) ∈ E(k̄) : v(x0) = 0} ∪ {0}. If E1 is defined by y 2 = f(x) = x3 + Ax + B, then we get one point in kerα for each root of v that is also a root of f (these are points (x0, 0) of order 2), two points for every other distinct root of v (since α(x0, y0) = 0 implies α(x0,−y0) = ...

متن کامل

18 . 783 Elliptic Curves Spring 2013

Andrew V. Sutherland A key ingredient to improving the efficiency of elliptic curve primality proving (and many other algorithms) is the ability to directly construct an elliptic curve E/Fq with a specified number of rational points, rather than generating curves at random until a suitable curve is found. To do this we need to develop the theory of complex multiplication. Recall from Lecture 7 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013